Overview of Fast Prime Generation Handout

Introduction As with tautology checking and complementation, the fast prime generation algorithm uses a recursive “divide-and-conquer” approach. Given an initial cover, the algorithm recursively divides the cover into smaller pieces until termination conditions are met. Results are then returned and reassembled into a final solution. For prime generation, this solution is the set of all prime implicants of the initial function.